A Faster Solving of the Maximum Independent Set Problem for Graphs with Maximal Degree 3
نویسنده
چکیده
We present an O(1.1034) algorithm computing a maximum independent set of a graph with maximal degree 3. This result improves currently best upper bound of O(1.1255) for the problem obtained by Chen et al [2].
منابع مشابه
Complexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملA Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs
We present a distributed algorithm for finding a (1 + ε)approximation of a Minimum Connected Dominating Set in the class of Growth-Bounded graphs, which includes Unit Disk graphs. In addition, the computed Connected Dominating Set guarantees a constant stretch factor on the length of a shortest path with respect to the original graph and induces a subgraph of constant degree. The nodes do not r...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملIndependent sets in (P6, diamond)-free graphs
An independent set (or a stable set) in a graph G is a subset of pairwise nonadjacent vertices of G. An independent set of G is maximal if it is not properly contained in any other independent set of G. The Maximum-Weight Independent Set (WIS) problem is the following: Given a graphG = (V,E) and a weight function w on V , determine an independent set of G of maximum weight. Let αw(G) denote the...
متن کامل